Proving Safety Properties of an Aircraft Landing Protocol Using I/O Automata and the PVS Theorem Prover: A Case Study

نویسندگان

  • Shinya Umeno
  • Nancy A. Lynch
چکیده

This paper presents an assertional-style verification of the aircraft landing protocol of NASA’s SATS (Small Aircraft Transportation System) concept [1] using the I/O automata framework and the PVS theorem prover. We reconstructed the mathematical model of the landing protocol presented in [2] as an I/O automaton. In addition, we translated the I/O automaton into a corresponding PVS specification, and conducted a verification of the safety properties of the protocol using the assertional proof technique and the PVS theorem prover.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proving safety properties of an aircraft landing protocol

This thesis presents an assertional-style verification of the aircraft landing protocol of NASA’s SATS (Small Aircraft Transportation System) concept of operation [16] using the timed and untimed I/O automata frameworks. We construct two mathematical models of the landing protocol using the above stated frameworks. First, we study a discrete model of the protocol, in which the airspace of the a...

متن کامل

Developing Strategies for Specialized Theorem Proving about Untimed , Timed , and Hybrid I / O Automata ?

In this paper we discuss how we intend to develop a specialized theorem proving environment for the Hybrid I/O Automata (HIOA) framework [7] over the PVS [11] theorem prover, and some of the issues involved. In particular, we describe approaches to using PVS that allow and encourage the development of useful proof strategies, and note some desired PVS features that would further help us to do s...

متن کامل

Specifying and Proving Timing Properties with TIOA Tools

This paper introduces the TIOA specification language for timed systems, for example, communication protocols with timeouts or timing-sensitive distributed algorithms. TIOA specifications denote Timed Input/Output Automata, which are composable state machines that evolve using both discrete transitions and continuous trajectories. This paper also outlines a scheme for translating TIOA specifica...

متن کامل

Translating Timed I/O Automata Specifications for Theorem Proving in PVS

The timed input/output automaton modeling framework is a mathematical framework for specification and analysis of systems that involve discrete and continuous evolution. In order to employ an interactive theorem prover in deducing properties of a timed input/output automaton, its statetransition based description has to be translated to the language of the theorem prover. This thesis describes ...

متن کامل

PVS Strategies for Proving Abstraction Properties of Automata

Abstractions are important in specifying and proving properties of complex systems. To prove that a given automaton implements an abstract specification automaton, one must first find the correct abstraction relation between the states of the automata, and then show that this relation is preserved by all corresponding action sequences of the two automata. This paper describes tool support based...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006